/*
 * Problem: 最大公约数
 * Author: Yuanshun L
 * Created: 30-Nov-2021
 * Topic: 辗转相除法，欧几里德算法
 */

#include<cstdio>

int gcd(int a,int b){
    if(b == 0) return a;
    return gcd(b, a%b);
}

int main(){

//    freopen("data.in","r",stdin);
//    freopen("data.out","w",stdout);
    int a = 186, b = 54;
    printf("%d & %d 的最大公约数: %d\n",a,b,gcd(a,b));

    return 0;

}
